Lower bounds for modal logics

Computing with Cylindric Modal Logics and Arrow Logics, Lower Bounds

A Uniform Tableaux Method for Nonmonotonic Modal Logics

We present a semantic tableaux calculus for propositional nonmonotonic modal logics, based on possible-worlds characterisations for nonmonotonic modal logics. This method is parametric with respect to both the modal logic and the preference semantics, since it handles in a uniform way the entailment problem for a wide class of nonmonotonic modal logics: McDermott and Doyle's logics and ground l...

On the Size of Shortest Modal Descriptions

We address the problems of separation and description in some fragments of modal logics. The former consists in finding a formula that is true in some given subset of the domain and false in another. The latter is a special case when one separates a singleton from the rest. We are interested in the shortest size of both separations and descriptions. This is motivated by applications in computat...

Strict Lower Bounds for Model Checking BPA

We show strict lower bounds for the complexity of several model checking problems for BPA and branching-time logics. Model checking with Hennessy-Milner Logic PSPACE-hard, while model checking with the modal-calculus is EXPTIME-hard. By combining these results with already established upper bounds it follows that the model checking problems are PSPACE-complete and EXPTIME-complete, respectively.

Lower complexity bounds in justification logic

Justification Logic studies epistemic and provability phenomena by introducing justifications/proofs into the language in the form of justification terms. Pure justification logics serve as counterparts of traditional modal epistemic logics, and hybrid logics combine epistemic modalities with justification terms. The computational complexity of pure justification logics is typically lower than ...

The craft of model making: PSPACE bounds for non-iterative modal logics

The methods used to establish PSPACE -bounds for modal logics can roughly be grouped into two classes: syntax driven methods establish that exhaustive proof search can be performed in polynomial space whereas semantic approaches directly construct shallow models. In this paper, we follow the latter approach and establish generic PSPACE bounds for a large and heterogeneous class of modal logics ...